Could a combinatorial optimization problem be solved by a differential equation ?
نویسنده
چکیده
Abstract. For the Traveling Salesman Problem ( ), a combinatorial optimization problem, a feedforward artificial neural network model, the Continuous Hopfield Network ( ) model, is used to solve it. This neural network approach is based on the solution of a differential equation. An appropriate parameter setting of this differential equation can assure that the solution is associated with a tour for the .
منابع مشابه
An optimization technique for vendor selection with quantity discounts using Genetic Algorithm
Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...
متن کاملOptimization of solution stiff differential equations using MHAM and RSK methods
In this paper, a nonlinear stiff differential equation is solved by using the Rosenbrock iterative method, modified homotpy analysis method and power series method. The approximate solution of this equation is calculated in the form of series which its components are computed by applying a recursive relations. Some numerical examples are studied to demonstrate the accuracy of the presented meth...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کامل